SharedDB: Killing One Thousand Queries With One Stone

نویسندگان

  • Georgios Giannikis
  • Gustavo Alonso
  • Donald Kossmann
چکیده

Traditional database systems are built around the query-at-a-time model. This approach tries to optimize performance in a best-effort way. Unfortunately, best effort is not good enough for many modern applications. These applications require response time guarantees in high load situations. This paper describes the design of a new database architecture that is based on batching queries and shared computation across possibly hundreds of concurrent queries and updates. Performance experiments with the TPC-W benchmark show that the performance of our implementation, SharedDB, is indeed robust across a wide range of dynamic workloads.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Insights on the “DC Shock-Reperfusion” in ST Elevation Myocardial Infarction: Killing Two Birds with One Stone?

Cite this article as: Özdamar Ü, Akboğa MK, Bayraktar MF, Özeke Ö. New Insights on the "DC Shock-Reperfusion" in ST Elevation Myocardial Infarction: Killing Two Birds with One Stone? Balkan Med J 2017;34:382-3 ©Copyright 2017 by Trakya University Faculty of Medicine / The Balkan Medical Journal published by Galenos Publishing House. New Insights on the “DC Shock-Reperfusion” in ST Elevation Myo...

متن کامل

Finding Shortest Paths on Terrains by Killing Two Birds with One Stone

With the increasing availability of terrain data, e.g., from aerial laser scans, the management of such data is attracting increasing attention in both industry and academia. In particular, spatial queries, e.g., k-nearest neighbor and reverse nearest neighbor queries, in Euclidean and spatial network spaces are being extended to terrains. Such queries all rely on an important operation, that o...

متن کامل

Killing Two Birds with One Stone - Querying Property Graphs using SPARQL via GREMLINATOR

Knowledge graphs have become popular over the past decade and frequently rely on the Resource Description Framework (RDF) or Property Graph (PG) databases as data models. However, the query languages for these two data models – SPARQL for RDF and the PG traversal language Gremlin – are lacking interoperability. We present Gremlinator, the rst translator from SPARQL – the W3C standardised langua...

متن کامل

Interactive and Deterministic Data Cleaning A Tossed Stone Raises a Thousand Ripples

We present Falcon, an interactive, deterministic, and declarative data cleaning system, which uses SQL update queries as the language to repair data. Falcon does not rely on the existence of a set of pre-defined data quality rules. On the contrary, it encourages users to explore the data, identify possible problems, and make updates to fix them. Bootstrapped by one user update, Falcon guesses a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • PVLDB

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2012